Cutting Planes in Combinatorics
نویسندگان
چکیده
منابع مشابه
Cutting planes and beyond
1 Abstract We present extensions to the traditional cutting plane that become practical with the availability of virtual reality devices. These extensions take advantage of the intuitive ease of use associated with the cutting metaphor. Using their hands as the cutting tool, users interact directly with the data to generate arbitrarily oriented planar surfaces, linear surfaces, and curved surfa...
متن کاملLower Bounds for Cutting Planes
Cutting Planes (CP) is a refutation propositional proof system whose lines are linear inequalities in Boolean variables. Exponential lower bounds for CP refutations of a clique/coclique dichotomy have been proved by Bonet, Pitassi and Raz, and by Kraj́ıček, using similar methods. Their proofs only apply when all the coefficients in the proof are small. Pudlák proved a lower bound for the same st...
متن کاملUnderstanding Cutting Planes for QBFs
We define a cutting planes system CP+∀red for quantified Boolean formulas (QBF) and analyse the proof-theoretic strength of this new calculus. While in the propositional case, Cutting Planes is of intermediate strength between resolution and Frege, our findings here show that the situation in QBF is slightly more complex: while CP+∀red is again weaker than QBF Frege and stronger than the CDCL-b...
متن کاملSemantic Versus Syntactic Cutting Planes
In this paper, we compare the strength of the semantic and syntactic version of the cutting planes proof system. First, we show that the lower bound technique of [22] applies also to semantic cutting planes: the proof system has feasible interpolation via monotone real circuits, which gives an exponential lower bound on lengths of semantic cutting planes refutations. Second, we show that semant...
متن کاملCompression of Arbitrary Cutting Planes
We present an efficient algorithm for compressing the data necessary to represent an arbitrary cutting plane extracted from a three dimensional curvilinear data set. The cutting plane technique is an important visualization method for time-varying 3D simulation results since the data sets are often so large. An efficient compression algorithm for these cutting planes is especially important whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1985
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(85)80031-7